Search results for "Pareto principle"
showing 10 items of 47 documents
More is more? : Forest management allocation at different spatial scales to mitigate conflicts between ecosystem services
2017
Context: Multi-objective management can mitigate conflicts among land-use objectives. However, the effectiveness of a multi-objective solution depends on the spatial scale at which land-use is optimized. This is because the ecological variation within the planning region influences the potential for site-specific prioritization according to the different objectives. Objectives: We optimized the allocation of forest management strategies to maximize the joint production of two conflicting objectives, timber production and carbon storage, at increasing spatial scales. We examined the impacts of the extent of the planning region on the severity of the conflict, the potential for its mitigation…
Institutions and Innovation as Driving Forces Towards a Smart City and Sustainable Territorial Development
2018
The aim of the chapter is the analysis of innovation and institution as key-elements for reaching a higher social welfare and for improving environmental quality. To determine a social optimum or a Pareto improvement, we consider the interaction between institution and firm in the short and in the medium/long run. Using a static comparative analysis, the interaction of these two agents, institution and market, is examined. Within the market an entrant and an incumbent firm are present, and the entrant firm radically innovates. Even if in the short run results show that the market alone is able to realize a Pareto improvement, an institution action through an innovation adoption is a prefera…
V I G — A Visual and Dynamic Decision Support System for Multiple Objective Linear Programming
1989
In this paper we describe the principles of VIG (Visual Interactive Goal Programming), a Multiple Criteria Decision Support System, recently developed by Korhonen. PARETO RACE is a corner-stone of this system, which is designed to support both the modelling and solving of a multiple objective linear programming problem. The interface is based on one main menu, spreadsheets, and interactive use of computer graphics. VIG provides the decision-maker with the possibility to approach his/her decision problem by using an “evolutionary approach”. This means that the decision-maker does not have to specify the model precisely prior to solving the problem. In fact, the model evolves progressively. W…
On the Extension of the DIRECT Algorithm to Multiple Objectives
2020
AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…
ELECTRE III to dynamically support the decision maker about the periodic replacements configurations for a multi-component system
2013
The problem tackled by the present paper concerns the selection of the elements of a repairable and stochastically deteriorating multi-component system to replace (replacements configuration) during each scheduled and periodical system stop within a finite optimization cycle, by ensuring the simultaneous minimization of both the expected total maintenance cost and the system unavailability. To solve the considered problem, a combined approach between multi-objective optimization problem (MOOP) and multi-criteria decision making (MCDM) resolution techniques is proposed. In particular, the @e constraint method is used to single out the optimal Pareto frontier whereas the ELECTRE III multi-cri…
Determination of Pareto frontier in multi-objective maintenance optimization
2011
Abstract The objective of a maintenance policy generally is the global maintenance cost minimization that involves not only the direct costs for both the maintenance actions and the spare parts, but also those ones due to the system stop for preventive maintenance and the downtime for failure. For some operating systems, the failure event can be dangerous so that they are asked to operate assuring a very high reliability level between two consecutive fixed stops. The present paper attempts to individuate the set of elements on which performing maintenance actions so that the system can assure the required reliability level until the next fixed stop for maintenance, minimizing both the globa…
Tax compliance and wealth inequality
2019
In this work, we theoretically approach optimal taxing in a public good provision context in a society where wealth is Pareto distributed. Our main result shows that high levels of wealth inequalit...
A computational proposal for a robust estimation of the Pareto tail index: An application to emerging markets
2022
Abstract In this work, we backtest and compare, under the VaR risk measure, the fitting performances of three classes of density distributions (Gaussian, Stable and Pareto) with respect to three different types of emerging markets: Egypt, Qatar and Mexico. We also propose a new technique for the estimation of the Pareto tail index by means of the Threshold Accepting (TAVaR) and the Hybrid Particle Swarm Optimization algorithm (H-PSOVaR). Furthermore, we test the accuracy and robustness of our estimates demonstrating the effectiveness of the proposed approach.
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
1990
This paper deals with multiobjective programming in which the objective functions are nonsymmetric distances (derived from different gauges) to the points of a fixed finite subset of ℝn. It emphasizes the case in which the gauges are polyhedral. In this framework the following result is known: if the gauges are polyhedral, then each Pareto optimum is the solution to a Fermat—Weber problem with strictly positive coefficients. We give a new proof of this result, and we show that it is useful in finding the whole set of efficient points of a location problem with polyhedral gauges. Also, we characterize polyhedral gauges in terms of a property of their subdifferential.
A Feature Rich Distance-Based Many-Objective Visualisable Test Problem Generator
2019
In optimiser analysis and design it is informative to visualise how a search point/population moves through the design space over time. Visualisable distance-based many-objective optimisation problems have been developed whose design space is in two-dimensions with arbitrarily many objective dimensions. Previous work has shown how disconnected Pareto sets may be formed, how problems can be projected to and from arbitrarily many design dimensions, and how dominance resistant regions of design space may be defined. Most recently, a test suite has been proposed using distances to lines rather than points. However, active use of visualisable problems has been limited. This may be because the ty…